Repacking rhodium
نویسندگان
چکیده
منابع مشابه
The Broadcaster-Repacking Problem
The Federal Communications Commission’s (FCC’s) ongoing Incentive Auction will, if successful, transfer billions of dollars of radio spectrum from television broadcasters to mobile-network operators. Hundreds of broadcasters may go off the air. Most of those remaining on the air, including hundreds of Canadian broadcasters not bidding, will have to move to new channels to continue broadcasting....
متن کاملSolving the Station Repacking Problem
We investigate the problem of repacking stations in the FCC’s upcoming, multi-billion-dollar “incentive auction”. Early efforts to solve this problem considered mixed-integer programming formulations, which we show are unable to reliably solve realistic, national-scale problem instances. We describe the result of a multi-year investigation of alternatives: a solver, SATFC, that has been adopted...
متن کاملFully-Dynamic Bin Packing with Limited Repacking
We consider the bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. The objective here is to obtain algorithms achieving low asymptotic competitive ratio while changing the packing sparingly between updates. We associate with each item i a movement cost ci ≥ 0. We wish to achieve good approximation guarantees while incurring a movement cost of β ...
متن کاملThe Repacking Efficiency for Bandwidth Packing Problem
Repacking is an efficient scheme for bandwidth packing problem (BPP) in centralized networks (CNs), where a central unit allocates bandwidth to the rounding terminals. In this paper, we study its performance by proposing a new formulation of the BPP in the CN, and introducing repacking scheme into next fit algorithm in terms of the online constraint. For the realistic applications, the effect o...
متن کاملPartial FPGA Rearrangement by Local Repacking
Partial rearrangement of executing tasks has been proposed as a means of alleviating the fragmentation of free logic elements that occurs on space–shared run–time reconfigurable FPGA systems. In this paper, we present and assess a new solution to this strategy. Local repacking of executing tasks aims to free sufficient contiguous resources for the next waiting task so as to minimize allocation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2017
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.355.6323.364-d